An Efficient Parallel Algorithm for the All Pairs Shortest Path Problem
نویسنده
چکیده
The all pairs shortest path problem is a class of the algebraic path problem. Many parallel algorithms for the solution of this problem appear in the literature. One of the efficient parallel algorithms on W-RAM model is given by Kucera[17]. Though efficient, algorithms written for the W-RAM model of parallel computation are too idealistic to be implemented on the current hardware. In this report we present an efficient parallel algorithm for the solution of this problem using a relatively new model of parallel computing, Processor Arrays with Reconfigurable Bus Systems. The
منابع مشابه
الگوریتم مستطیل آبشاری و ماتریس انتقال در شبکه های کوتاه ترین مسیر بادور
Shortest path problem is among the most interesting problems in the field of graph and network theory. There are many efficient matrix based algorithms for detecting of shortest path and distance between all pairs of this problem in literature. In this paper, a new exact algorithm, named Cascade Rectangle Algorithm, is presented by using main structure of previous exact algorithms and developin...
متن کاملA Computational Study of Parallel Algorithms for the All-pairs Shortest Path Problem
This paper presents experiences from the implementation of parallel algorithms for the all-pairs shortest path problem. A brief survey of the problem is given and efficient techniques for exploiting the memory hierarchy of parallel computers are described. Comparing the algorithms at a practical level, the importance of issues such as synchronisation and data locality is established.
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملGeneral Parallel Computation on Commodity Graphics Hardware: Case Study with the All-Pairs Shortest Paths Problem
Programmability and IEEE-standard floating point arithmetic makes the latest commodity graphics processors (GPUs) an attractive platform for general parallel computing. In this paper we describe the implementation of the Warshall-Floyd algorithm on a class of GPUs. All-pairs shortest paths problem is relevant to many practical applications. Efficient GPU implementation of the Warshall-Floyd alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988